Bypassing the bandwidth theorem withPTsymmetry

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bypassing Pauli’s Theorem

We define a quantum–mechanical time operator that is selfadjoint and compatible with the energy operator having a spectrum bounded from below. On their common domain, the operators of time and energy satisfy the expected canonical commutation relation. Pauli’s theorem is bypassed because the correspondence between time and energy is not given by the standard Fourier transformation, but by a var...

متن کامل

Bandwidth theorem for random graphs

A graph G is said to have bandwidth at most b, if there exists a labeling of the vertices by 1, 2, . . . , n, so that |i − j| ≤ b whenever {i, j} is an edge of G. Recently, Böttcher, Schacht, and Taraz verified a conjecture of Bollobás and Komlós which says that for every positive r,∆, γ, there exists β such that if H is an n-vertex r-chromatic graph with maximum degree at most ∆ which has band...

متن کامل

A. a Gain-bandwidth Theorem for the Middle Ear

Prof. L. D. Braida Prof. W. M. Siebert Dr. E. P. Lindholm Prof. S. K. Burns Prof. T. F. Weisstf** D. W. Altmannt Prof. H. S. Colburnt Dr. J. S. Barlowtt R. M. Brownt Prof. L. S. Frishkopf Mr. N. I. Durlach D. J. Callahan Prof. J. L. Goldsteint Dr. R. D. Hall A. H. Cristt Prof. J. J. Guinan, Jr.t Dr. N. Y. S. KiangT W. F. Kelley Prof. R. G. Markj Dr. H. J. Liff L. H. Seifel Prof. W. T. Peaket S....

متن کامل

A Brooks-type Theorem for the Bandwidth of Interval Graphs

Let G be an interval graph. The layout that arranges the intervals in order by right endpoint easily shows that the bandwidth of G is at most its maximum degree ∆. Hence, if G contains a clique of size ∆ + 1, then its bandwidth must be ∆. In this paper we prove a Brooks-type bound on the bandwidth of interval graphs. Namely, the bandwidth of an interval graph is at most ∆, with equality if and ...

متن کامل

On the bandwidth of Mobius graphs

Bandwidth labelling is a well known research area in graph theory. We provide a new proof that the bandwidth of Mobius ladder is 4, if it is not a $K_{4}$, and investigate the bandwidth of a wider class of Mobius graphs of even strips.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Physical Review A

سال: 2012

ISSN: 1050-2947,1094-1622

DOI: 10.1103/physreva.85.062122